Physical Portrayal of Computational Complexity
نویسندگان
چکیده
منابع مشابه
Physical portrayal of computational complexity
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because information requires physical representations and because many natural processes have been recognized to complete in non-deterministic polynomial time ( ). The irreversible process with three or more d...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملMechanical Computation : The Computational Complexity of Physical Computing Devices
Computing Machine Models. To gauge the computational power of a family of mechanical computers, we will use a widely known abstract computational model known as the Turing Machine, defined in this section. The Turing Machine. The Turing machine model formulated by Alan Turing [1] was the first complete mathematical model of an abstract computing machine that possessed universal computing power....
متن کاملMechanical Computing: The Computational Complexity of Physical Devices
Computing Machine Models To gage the computational power of a family of mechanical computers, we will use a widely known abstract computational model known as the Turing machine, defined in this section. The Turing machine. The Turing machine model formulated by Alan Turing (1937) was the first complete mathematical model of an abstract computing machine that possessed universal computing power...
متن کاملThe observers' paradox: apparent computational complexity in physical systems
Many researchers in AI and cognitive science believe that the complexity of a behavioral description reflects the underlying information processing complexity of the mechanism producing the behavior. This paper explores the foundations of this complexity argument. We first distinguish two types of complexity judgements that can be applied to these descriptions and then argue that neither type c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Computational Mathematics
سال: 2012
ISSN: 2090-7842
DOI: 10.5402/2012/321372